Optimal Full Matching and Related Designs via Network Flows
نویسندگان
چکیده
منابع مشابه
Optimal Full Matching and Related Designs via Network Flows
In the matched analysis of an observational study, confounding on covariates X is addressed by comparing members of a distinguished group (Z = 1) to controls (Z = 0) only when they belong to the same matched set. The better matchings, therefore, are those whose matched sets exhibit both dispersion in Z and uniformity in X. For dispersion in Z, pair matching is best, creating matched sets that a...
متن کاملQuantum Algorithms for Matching and Network Flows
We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n √ m + n log n), finding a maximal non-bipartite matching in time O(n( √ m/n+ log n) log n), and finding a maximal flow in an integer network in time O(min(n √ m · U, √ nUm) log n), where n is the number of vertices, m is the number of edges, and U ≤ n is an upper bound on the capacit...
متن کاملCoalitional Games via Network Flows
We introduce a new representation scheme for coalitional games, called coalition-flow networks (CF-NETs), where the formation of effective coalitions in a task-based setting is reduced to the problem of directing flow through a network. We show that our representation is intuitive, fully expressive, and captures certain patterns in a significantly more concise manner compared to the conventiona...
متن کاملD-optimal designs via a cocktail algorithm
A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This cocktail algorithm extends the well-known vertex direction method (VDM; Fedorov 1972) and the multiplicative algorithm (Silvey, Titterington and Torsney, 1978), and shares their simplicity and monotonic convergence properties. Numerical examples show that the cocktail algorithm can lead to dramat...
متن کاملOptimal Network Designs for Spatial Prediction
A practical problem in spatial statistics is that of constructing spatial sampling designs for environmental monitoring networks. Among the several purposes for which a monitoring network may be designed for, there is that of interpolation. In this paper, a criterion for spatial designs that emphasize the utility of the network for spatial interpolation of a random field X is discussed. Within ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2006
ISSN: 1061-8600,1537-2715
DOI: 10.1198/106186006x137047